منابع مشابه
Deciding Concurrent Planar Monotonic Linear Hybrid Systems
Decidability results for hybrid automata often exploit subtle properties about dimensionality (number of continuous variables), and interaction between discrete transitions and continuous trajectories of variables. Thus, the decidability results often do not carry over to parallel compositions of hybrid automata, even when there is no communication other than the implicit synchronization of tim...
متن کاملMonotonic Fuzzy Systems As Universal Approximators For Monotonic Functions
In this paper, we propose a constructive method to develop a fuzzy system having a monotonic input–output relationship and prove that the developed fuzzy system can approximate any continuously differentiable monotonic function with any desired degree of accuracy. The fuzzy system is constructed with complete and consistent input membership functions and imposes special parametric constraints o...
متن کاملHybrid Rate - Monotonic / Reward - Based Scheduling of Real - Time Embedded Systems
A common need of many embedded systems is the on-line scheduling of periodic, independent, preemptible real-time sets of tasks composed of a mandatory and an optional part. In this paper, a scheduling method, allowing a rearrangement of slack time based on the detection of singular instants during the processing, is presented. The priority policies used are rate monotonic and reward-based, for ...
متن کاملNon-monotonic Negation in Hybrid Probabilistic Logic Programs
In [23], a new Hybrid Probabilistic Logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic Logic Programs framework of [23] is extended to allow non-monotonic negation, and two alternative semantics are defined: stable probabilistic model semantics and ...
متن کاملSuccessive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
Current symbolic techniques for the automated reasoning over undecidable hybrid automata, force one to choose between the refinement of either an overapproximation or an underapproximation of the set of reachable states. When the analysis of branching time temporal properties is considered, the literature has developed a number of abstractions techniques based on the simulation preorder, that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2005
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.11.003